A Refinement of Strong Sequentiality for Term Rewriting with Constructors
نویسنده
چکیده
The notion of call-by-need evaluation has turned out to be very fruitful when applied to dialects of the i-calculus (Henderson and Morris, 1976, in “Proc. 3rd ACM Symp. on the Principles of Programming Languages, Atlanta; Kahn and Mac Queen, 1977, in “IFIP 77,” North-Holland, Amsterdam; Turner, 1979, Software Practice and Experience, Vol. 9; Vuillemin, 1974, J. Cornput. System3 .Sci. 9, 332-354; Wadsworth, 1971, Ph.D. dissertation, Oxford University% England). The analogous idea of sequenlialify for term rewriting systems described by lirstorder equations has been considered by Hoffman-O’Donnell (1979, in “Proc. 5th ACM Symp. on the Principles of Programming Languages, San Antonio.” 1984. in “Proc. 11th ACM Symp. on the Principles of Programming Languages, Salt Lake City) and Huet-Levy (1979, Technical Report No. 359, INRIA, Le Chesney, France), of which the latter is generally considered to be the most complete theoretical treatment of the subject to date, Huet-Levy (1979) detined the notion of strong sequentiahty to describe the class of linear term rewriting systems for which call-by-need computation is practical. This paper introduces an improved version of strong sequentiality called ieff sequentiality. Unlike strong .sequentiality, left sequentiality is based on possible rather than arbitrary (and often impossible) sequences of reductions. We show that left sequentiality is more general than strong sequentiality when applied to individual terms, but is equivalent to the latter when cosidered as a property of admissible sets of left-hand sides for systems of equations. Huet-Levy (1979) showed that there are safe redex selection algorithms, i.e., algorithms deriving normal forms whenever possible, for systems based on strongly sequential sets of left-hand sides. We show that there is no algorithm which is safe for all systems based on a set of left-hand sides if that set is not left sequential. In other words, left sequentiality is not only sufficient, it is also necessar~~ for safe computation based on the analysis of left-hand sides alone. 1 I987 Academic Press, Inc.
منابع مشابه
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors
We introduce the notions of sequentiality and strong sequentiality in order-sorted rewriting systems, both closely related to the subsort order and to the form of declarations of the signature. We deene free sequentiality for the class of orthogonal systems with constructors, a notion which does not impose conditions over the signature. We provide an eeective decision procedure for free sequent...
متن کاملLazy productivity via termination
We present a procedure for transforming strongly sequential constructor-based term rewriting systems (TRSs) into context-sensitive TRSs in such a way that productivity of the input system is equivalent to termination of the output system. Thereby automated termination provers become available for proving productivity. A TRS is called productive if all its finite ground terms are constructor nor...
متن کاملTerm Graph Rewriting and Strong Sequentiality
This paper propagates the use of term graph rewriting systems as a formal computational model. The deenition of both term graphs and the reduction relation on term graphs are more complex than their corresponding notions in term rewriting systems. Consequently, it is often believed that reasoning about term graph rewriting systems is inherently more diicult than reasoning about term rewriting s...
متن کاملSequentiality, Second Order Monadic Logic and Tree Automata
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. L evy deene in 9] the sequentiality of a predicate P on partially evaluated terms. We show ...
متن کاملSemantics and Strong Sequentiality of Priority Term Rewriting Systems
This paper gives an operational semantics of priority term rewriting systems (PRS) by using conditional systems, whose reduction is decidable and stable under substitution. We also de ne the class of strong sequential PRSs and show that this class is decidable. Moreover, we show that the index rewriting of strong sequential PRSs gives a normalizing strategy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 72 شماره
صفحات -
تاریخ انتشار 1987